Learning Tree Languages from Positive Examples and Membership Queries
نویسندگان
چکیده
One of the most astonishing discovery of Chomsky [13] is the universal grammar which is a model of how human language works. The universal grammar is an innate combinatorial system from which every language, French, English, Japanese, can be derived. What is the implication of Chomsky’s universal grammar for grammatical inference? We think it gives a strong intuition for the mathematical modeling of language learning. Before going further, let us focus on the linguistic aspect of the language acquisition processes.
منابع مشابه
Polynomial time learning of simple deterministic languages via queries and a representative sample
We show that simple deterministic languages are polynomial time learnable viamembership queries if the learner knows a special finite set of positive examples. This finite set is called a representative sample and has been introduced byAngluin Inform. Control 51 (1981) to show that regular languages are polynomial time learnable viamembership queries. If simple deterministic languages are learn...
متن کاملcient Learning of Semi - structured Data from Queries
This paper studies the polynomial-time learnability of the classes of ordered gapped tree patterns (OGT) and ordered gapped forests (OGF) under the into-matching semantics in the query learning model of Angluin. The class OGT is a model of semi-structured database query languages, and a generalization of both the class of ordered/unordered tree pattern languages and the class of non-erasing reg...
متن کاملLearning from Queries and Examples with Tree-structured Bias
Incorporating declarative bias or prior knowledge into learning is an active research topic in machine learning. Tree-structured bias speciies the prior knowledge as a tree of \relevance" relationships between attributes. This paper presents a learning algorithm that implements tree-structured bias, i.e., learns any target function probably approximately correctly from random examples and membe...
متن کاملAn example distribution for probabilistic query learning of simple deterministic languages
In this paper, we show a special example distribution on which the learner can guess a correct simple deterministic grammar in polynomial time from membership queries and random examples. At first, we show a learning algorithm of simple deterministic languages from membership and equivalence queries. This algorithm is not a polynomial time algorithm but, assuming a special example distribution,...
متن کاملPolynomial Time Learnability of Simple Deterministic Languages from MAT and a Representative Sample
We propose a learning algorithm for simple deterministic languages from queries and a priori knowledge. To the learner, a special finite subset of the target language, called a representative sample, is provided at the beginning and two types of queries, equivalence queries and membership queries, are available. This learning algorithm constructs nonterminals of a hypothesis grammar based on Is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004